Graph operations and neighborhood polynomials

The neighborhood polynomial of graph $G$ is the generating function for number vertex subsets which vertices have a common neighbor in $G$. In this paper, we investigate behavior under several operations. Specifically, provide an explicit formula obtained from given by attachment. We use result to propose recursive algorithm calculation polynomial. Finally, prove that can be found polynomial-time class $k$-degenerate graphs.